package com.topInterview;

/**
 * @Author: huangzhigao
 * @Date: 2022/2/20 16:22
 */
public class Leecode70_climb {
    public int climbStairs(int n) {
        if(n==1){
            return 1;
        }
        if(n == 2){
            return 2;
        }
        int[] dp = new int[n+1];
        dp[1] =1;
        dp[2] = 2;
        for(int i =3;i<=n;i++){
            dp[i] = dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}
